منابع مشابه
Automata theory in nominal sets
We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such alphabets and the ensuing automata theory, where the key role is played by an automorphism group of the alphabet. In the process, we generalize nominal sets due to Gabbay and Pitts.
متن کاملNominal Cellular Automata
The emerging field of Nominal Computation Theory is concerned with the theory of Nominal Sets and its applications to Computer Science. We investigate here the impact of nominal sets on the definition of Cellular Automata and on their computational capabilities, with a special focus on the emergent behavioural properties of this new model and their significance in the context of computationorie...
متن کاملNominal deterministic omega automata
Nominal sets, presheaf categories, and named sets have successfully served as models of the state space of process calculi featuring resource generation. More recently, automata built in such categories have been studied as acceptors of languages of finite words over infinite alphabets. In this paper we investigate automata whose state spaces are nominal sets, and that accept infinite words. Th...
متن کاملNominal Presentations of the Cubical Sets Model of Type Theory
The cubical sets model of Homotopy Type Theory was introduced by Bezem, Coquand and Huber using a particular category of presheaves. We show that this category is equivalent to a category of sets whose elements have a finite support property with respect to an action of a monoid of name substitutions; and that this is isomorphic to a category of nominal sets equipped with source and target maps...
متن کاملNominal Presentation of Cubical Sets Models of Type Theory
The cubical sets model of Homotopy Type Theory introduced by Bezem, Coquand and Huber [2] uses a particular category of presheaves. We show that this presheaf category is equivalent to a category of sets equipped with an action of a monoid of name substitutions for which a finite support property holds. That category is in turn isomorphic to a category of nominal sets [15] equipped with operati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2014
ISSN: 1860-5974
DOI: 10.2168/lmcs-10(3:4)2014